Explaining updates by minimal sums
نویسندگان
چکیده
منابع مشابه
Explaining Updates by Minimal Sums
Human reasoning about developments of the world involves always an assumption of inertia. We discuss two approaches for formalizing such an assumption, based on the concept of an explanation: (1) there is a general preference relation ≺ given on the set of all explanations, (2) there is a notion of a distance between models and explanations are preferred if their sum of distances is minimal. Ea...
متن کاملTheory of minimal updates in holography
Consider two quantum critical HamiltoniansH and H̃ on a d-dimensional lattice that only differ in some region R. We study the relation between holographic representations, obtained through real-space renormalization, of their corresponding ground states |ψ〉 and |ψ̃〉. We observe that, even though |ψ〉 and |ψ̃〉 disagree significantly both inside and outside region R, they still admit holographic desc...
متن کاملMinimal Decomposition of Inde nite Hypergeometric Sums
We present an algorithm which, given a hypergeometric term T (n), constructs hypergeometric terms T1(n) and T2(n) such that T (n) = T1(n + 1) ? T1(n) + T2(n), and T2(n) is minimal in some sense. This solves the decomposition problem for indeenite sums of hypergeometric terms: T1(n + 1) ? T1(n) is the \summable part" and T2(n) the \non-summable part" of T (n).
متن کاملNon-minimal sums of disjoint products
We re ne a conjecture of M. O. Locks and J. M. Wilson [Reliability Engineering and System Safety 46 (1994), 283-286] regarding disjoint forms of the Abraham Reliability problem. We also present other examples of reliability problems with the interesting property that their minimal disjoint forms do not arise from the familiar tautologyM1+:::+Mn M1+(M2 M1)+(M3 M2 M1)+:::+(Mn Mn 1 ::: M1):
متن کاملA curvilinear method based on minimal-memory BFGS updates
We present a newmatrix-free method for the computation of negative curvature directions based on the eigenstructure of minimal-memory BFGS matrices. We determine via simple formulas the eigenvalues of these matrices and we compute the desirable eigenvectors by explicit forms. Consequently, a negative curvature direction is computed in such a way that avoids the storage and the factorization of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00377-7